Decomposition of verification of machine programs based on control-state Abstract State Machines
نویسنده
چکیده
We are presenting a method verifying programs based on extended control-state Abstract State Machines (ASM). Programs are special initial states in ASM’s. The aim is to prove that every run holds an algebraic specification of functions. The proof of different functions could be made by independent steps.
منابع مشابه
Tool-Supported Use of UML for Developing B Projects
Much work has been undertaken to find suitable translations from UML to B. Most of this work concentrates on the abstract machine specification level and de-composition of a large machine into smaller machines based on the UML classes and their relationships. However, the primary decomposition mechanism in B is not the inclusion of other machines; it is decomposition by refinement. An abstract ...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملAutomated Verification of Specifications with Typestates and Access Permissions
We propose an approach to formally verify Plural specifications based on access permissions and typestates, by model-checking automatically generated abstract state-machines. Our exhaustive approach captures all the possible behaviors of abstract concurrent programs implementing the specification. We describe the formal methodology employed by our technique and provide an example as proof of co...
متن کاملAbstract State Machines: Verification Problems and Complexity Dissertation
State Machines: Verification Problems and Complexity
متن کاملStatechart Verification with iState
The statechart formalism, proposed by Harel [6] as an extension of conventional finite state machines, is a visual language for specifying reactive systems. It addresses the state explosion problem of state transition diagrams when modeling systems with parallel threads of control by introducing the concepts of hierarchy, concurrency, and communication. The iState tool translates statecharts in...
متن کامل